On Index Selection Schemes for Nested Object Hierarchies

In this paper we address the problem of devising a set of indexes for a nested object hierarchy in an object-oriented database to improve the overall system performance. It is noted that the e ects of two indexes could be entangled in that the inclusion of one index might a ect the bene t achievable by the other index. Such a phenomenon is termed index interaction. Clearly, the e ect of index interaction needs to be taken into consideration when a set of indexes is being built. The index selection problem is rst formulated and four index selection algorithms are evaluated via simulation. The e ects of di erent objective functions, which guide the search in the index selection algorithms, are also investigated. It is shown by simulation results that the greedy algorithm which is devised in light of the phenomenon of index interaction performs fairly well in most cases. Sensitivity analysis for various database parameters is conducted.